ABSTRACT
We study a class of stochastic scheduling models that admit an extremely simple, near-optimal policy. In particular, we show that a greedy policy is within a factor of 2 of optimal. We discuss applications of our model to problems in wireless communications scheduling and product-line design in the face of demand seasonality. This is joint work with Carri Chan.
